package com.sfd.BinarySortTree;

import com.sfd.BinarySortTree.BinarySortTree.BiTNode;

public class Test {
	public static void main(String[] args) {
		BinarySortTree tree=new BinarySortTree();
		int[] a={62,58,88,47,73,99,35,51,37,93,29,36,49,48,50,56};
		
		for(int i=0;i<a.length;i++){
			tree.insertBST(tree.getRoot(), a[i]);
		}
//		tree.createBiTree(tree.getRoot());
//		System.out.println(tree.getRoot().rchild);
//		System.out.println(tree.getRoot().lchild);
		tree.inShow(tree.getRoot());
		System.out.println();
		BiTNode root=tree.getRoot();
		System.out.println(root);
		tree.deleteBST(root, 47);
		tree.inShow(tree.getRoot());
	}
}
